Distribution of genus among numerical semigroups with fixed Frobenius number
نویسندگان
چکیده
Abstract A numerical semigroup is a sub-monoid of the natural numbers under addition that has finite complement. The size its complement called genus and largest number in Frobenius number. We consider set semigroups with fixed f analyse their genus. find asymptotic distribution this show it product Gaussian power series. almost all have close to $$\frac{3f}{4}$$ 3 f 4 . denote by N ( ). While ) not monotonic we prove $$N(f)<N(f+2)$$ N ( ) < + 2 for every
منابع مشابه
The Frobenius problem for numerical semigroups
In this paper, we characterize those numerical semigroups containing 〈n1, n2〉. From this characterization, we give formulas for the genus and the Frobenius number of a numerical semigroup. These results can be used to give a method for computing the genus and the Frobenius number of a numerical semigroup with embedding dimension three in terms of its minimal system of generators.
متن کاملMinimal genus of a multiple and Frobenius number of a quotient of a numerical semigroup
Given two numerical semigroups S and T and a positive integer d, S is said to be one over d of T if S = {s ∈ N | ds ∈ T} and in this case T is called a d-fold of S. We prove that the minimal genus of the d-folds of S is g + ⌈ (d−1)f 2 ⌉, where g and f denote the genus and the Frobenius number of S. The case d = 2 is a problem proposed by Robles-Pérez, Rosales, and Vasco. Furthermore, we find th...
متن کاملFibonacci-like behavior of the number of numerical semigroups of a given genus
We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the number of semigroups of genus at most 50. The Wilf conjecture has also been checked for all numerical semigroups with genus in the same range.
متن کاملBounds on the Number of Numerical Semigroups of a Given Genus
Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number ng of numerical semigroups of genus g satisfies 2Fg 6 ng 6 1 + 3 · 2 , where Fg denotes the gth Fibonacci number.
متن کاملImproved Bounds on the Number of Numerical Semigroups of a given Genus
We improve the previously best known lower and upper bounds on the number ng of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use them to construct approximations of T by generating trees whose nodes are labeled by certain parameters of the semigroups. We then translate the succession rul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2022
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-022-10282-6